Survey-propagation decimation through distributed local computations
نویسندگان
چکیده
منابع مشابه
Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation
Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as ‘decimation,’ with reference to ana...
متن کاملScalable Distributed Aggregate Computations Through Collaboration
Computing aggregates over distributed data sets constitutes an interesting class of distributed queries. Recent advances in peer-to-peer discovery of data sources and query processing techniques have made such queries feasible and potentially more frequent. The concurrent execution of multiple and often identical distributed aggregate queries can place a high burden on the data sources. This pa...
متن کاملSurvey Propagation as local equilibrium equations
It has been shown experimentally that a decimation algorithm based on Survey Propagation (SP) equations allows to solve efficiently some combinatorial problems over random graphs. We show that these equations can be derived as sum-product equations for the computation of marginals in an extended space where the variables are allowed to take an additional value – ∗ – when they are not forced by ...
متن کاملTerrain Decimation through Quadtree Morphing
We present a new terrain decimation technique called a Quadtree Morph, or Q-morph. The new approach eliminates the usual popping artifacts associated with polygon reduction, replacing them with less objectionable smooth morphing. We show that Q-morphing is fast enough to create a view-dependent terrain model for each frame in an interactive environment. In contrast to most Geomorph algorithms, ...
متن کاملPerformance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem
We show that the Survey Propagation guided decimation algorithm fails to find satisfying assignments on random instances of the “Not-All-Equal-K-SAT” problem, well below the satisfiability threshold. Our analysis applies to a broad class of algorithms that may be described as “sequential local algorithms” — such algorithms iteratively set variables based on some local information and/or local r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2005
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2005/11/p11016